First-order logic

Results: 1172



#Item
81Logic / Logical connectives / Semantics / Philosophical logic / Model theory / Formal languages / Propositional calculus / Interpretation / First-order logic / If and only if / False / Modal logic

TRANSLATIONS IN SENTENTIAL LOGIC.

Add to Reading List

Source URL: dl.dropboxusercontent.com

Language: English
82Mathematics / Theoretical computer science / Mathematical logic / Predicate logic / Constraint programming / Electronic design automation / Logic in computer science / Satisfiability modulo theories / Z3 / First-order logic / Language Integrated Query / Computer program

Unleashing the Verification Genie in the Cloud Nikolaj Bjørner Microsoft Research, One Microsoft Way, Redmond, WA, 98074, USA Abstract Z3 is a state-of-the-art SMT (Satisfiability Modulo Theories)

Add to Reading List

Source URL: fm.csl.sri.com

Language: English - Date: 2010-11-01 03:01:08
83Syntax / Logic / Linguistics / Semantics / Logic in computer science / Predicate logic / Grammar / Event calculus / Logic programming / Predicate / Anaphora / First-order logic

Empirical Issues in Syntax and Semantics 8 O. Bonami & P. Cabredo Hofherr (eds, pp. 167–194 http://www.cssp.cnrs.fr/eiss8 Reambiguating: on the non-monotonicity

Add to Reading List

Source URL: www.cssp.cnrs.fr

Language: English - Date: 2011-02-21 12:14:22
84Logic / Mathematical logic / Mathematics / Type theory / Propositional calculus / Syntax / Predicate logic / CurryHoward correspondence / Dependent type / Lambda calculus / First-order logic / Proposition

logical verificationexercises 2 Exercise 1. This exercise is concerned with dependent types. We use the following definition in Coq: Inductive natlist_dep : nat -> Set := | nil_dep : natlist_dep 0

Add to Reading List

Source URL: www.cs.ru.nl

Language: English - Date: 2011-09-02 08:06:23
85Logic / Mathematical logic / Abstraction / Automated theorem proving / Reasoning / Syntax / Theoretical computer science / Artificial intelligence / Automated reasoning / Proof assistant / Isabelle / First-order logic

Downloaded from orbit.dtu.dk on: Aug 13, 2016 Formalization of Algorithms and Logical Inference Systems in Proof Assistants Schlichtkrull, Anders Published in:

Add to Reading List

Source URL: orbit.dtu.dk

Language: English - Date: 2016-01-29 23:14:59
86Logic / Mathematical logic / Predicate logic / Abstraction / Proof assistants / Mizar system / Andrzej Trybulec / Formal methods / First-order logic / TarskiGrothendieck set theory / Constructible universe / Mizar

Mizar Hands-on Tutorial Adam Naumowicz Artur Kornilowicz Adam Grabowski

Add to Reading List

Source URL: www.mizar.org

Language: English - Date: 2016-07-29 01:16:07
87Logic / Mathematical logic / Automated theorem proving / Mathematics / Mathematical proofs / Proof assistants / Logical truth / Proof theory / Isabelle / First-order logic / Automated reasoning / Theorem

J. Autom. Reasoning manuscript No. (will be inserted by the editor) Semi-intelligible Isar Proofs from Machine-Generated Proofs Jasmin Christian Blanchette · Sascha Böhme · Mathias Fleury · Steffen Juilf Smolka ·

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2015-07-02 06:25:32
88Logic / Mathematical logic / Mathematics / Model theory / Predicate logic / Finite model theory / Automated theorem proving / Boolean algebra / First-order logic / Resolution / FO / Interpretation

The limits of tractability in Resolution-based propositional proof systems Stefan Dantchev and Barnaby Martin? School of Engineering and Computing Sciences, Durham University, Science Labs, South Road, Durham DH1 3LE, U.

Add to Reading List

Source URL: www.bedewell.com

Language: English - Date: 2010-03-23 07:22:00
89Software engineering / Theoretical computer science / Mathematical logic / Formal methods / Computability theory / Lambda calculus / Subroutines / Satisfiability modulo theories / XC / HindleyMilner type system / First-order logic / Recursion

Transformation rules from UML4MBT meta-model to SMT meta-model for model animation Jérôme Cantenot Fabrice Ambert

Add to Reading List

Source URL: st.inf.tu-dresden.de

Language: English - Date: 2012-09-25 06:20:13
90Complexity classes / Structural complexity theory / FO / Finite model theory / Computational complexity theory / IP / Homomorphism / NP / Reduction / Symbol / P versus NP problem / Model theory

The complexity of positive first-order logic without equality∗ Florent Madelaine Univ Clermont1, EA2146, Laboratoire d’algorithmique et d’image de Clermont-Ferrand, Aubi`ere, F-63170, France. fmadelaine@laic.u-cler

Add to Reading List

Source URL: www.bedewell.com

Language: English - Date: 2009-11-10 10:55:46
UPDATE